منابع مشابه
Spectral Theorem for Convex Monotone Homogeneous Maps, and Ergodic Control
We consider convex maps that are monotone (i.e., that preserve the product ordering of ), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the addition of constants). We show that the fixed point set of , when it is non-empty, is isomorphic to a convex inf-subsemilattice of , whose dimension is at most equal to the nu...
متن کاملIndividual Ergodic Theorem for Unitary Maps of Random Matrices
Using simple techniques of finite von Neumann algebras, we prove a limit theorem for random matrices. 1. Notation and main result 1.1. Let (Ω,F , μ) be a probability space, and let H denote the space of all d × d matrices with entries in the complex space L2(Ω, μ). H is a Hilbert space with the inner product (1) 〈AB〉 = Φ(AB∗), where φ(A) = ∫ Ω tr A(ω)μ(dμ), and tr denotes the normalized trace o...
متن کاملAn Ergodic Theorem for Stochastic Programming Problems?
To justify the use of sampling to solve stochastic programming problems one usually relies on a law of large numbers for random lsc (lower semicontinuous) functions when the samples come from independent, identical experiments. If the samples come from a stationary process, one can appeal to the ergodic theorem proved here. The proof relies on thèscalarization' of random lsc functions.
متن کاملAn ergodic theorem for quantum counting processes
Modern research on quantum-mechanical counting processes, be it numerical simulations [Car] or experimental investigations [MYK], usually starts from the tacit assumption that for the study of statistical properties of the counting records it does not make a difference whether a large number of experiments is performed or a single very long one. This assumption amounts to ergodicity of these re...
متن کاملKingman's Subadditive Ergodic Theorem Kingman's Subadditive Ergodic Theorem
A simple proof of Kingman’s subadditive ergodic theorem is developed from a point of view which is conceptually algorithmic and which does not rely on either a maximal inequality or a combinatorial Riesz lemma.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 1987
ISSN: 0143-3857,1469-4417
DOI: 10.1017/s0143385700004168